An Algebraic Characterization of Temporal Logics on Finite Trees, Part 1
نویسنده
چکیده
We associate a modal operator with each language belonging to a given class of regular tree languages and use the cascade product of tree automata to give an algebraic characterization of the expressive power of the resulting logic.
منابع مشابه
Algebraic characterization of temporal logics on forests
We propose a rich class FL(L) of temporal logics, parametrized by a class L of modalities, evaluated over forests, that is, ordered tuples of ordered but unranked finite trees, an algebraic product operation (which we call the Moore product) of forest automata, and show that these logically defined classes of forest languages are characterized precisely via the Moore product. As an application ...
متن کاملOn Logically Defined Recognizable Tree Languages
We provide an algebraic characterization of the expressive power of various naturally defined logics on finite trees. These logics are described in terms of Lindström quantifiers, and particular cases include first-order logic and modular logic. The algebraic characterization we give is expressed in terms of a new algebraic structure, finitary preclones, and uses a generalization of the block p...
متن کاملCharacterization of Logics over Ranked Tree Languages
We study the expressive power of the logics EF + F, ∆2 and boolean combinations of Σ1 over ranked trees. In particular, we provide effective characterizations of those three logics using algebraic identities. Characterizations had already been obtained for those logics over unranked trees, but both the algebra and the proofs were dependant on the properties of the unranked structure and the pro...
متن کاملAlternating Automata: Checking Truth and Validity for Temporal Logics
We describe an automata-theoretic approach to the automated checking of truth and validity for temporal logics. The basic idea underlying this approach is that for any formula we can construct an alternating automaton that accepts precisely the models of the formula. For linear temporal logics the automaton runs on infinite words while for branching temporal logics the automaton runs on infinit...
متن کاملModel Theory of XPath on Data Trees. Part I: Bisimulation and Characterization
We investigate model theoretic properties of XPath with data (in)equality tests over the class of data trees, i.e., the class of trees where each node contains a label from a finite alphabet and a data value from an infinite domain. We provide notions of (bi)simulations for XPath logics containing the child, descendant, parent and ancestor axes to navigate the tree. We show that these notions p...
متن کامل